On the Existence of Telescopers for Mixed Hypergeometric Terms
نویسندگان
چکیده
We present a criterion for the existence of telescopers for mixed hypergeometric terms, which is based on multiplicative and additive decompositions. The criterion enables us to determine the termination of Zeilberger’s algorithms for mixed hypergeometric inputs.
منابع مشابه
The Existence of Telescopers for Hyperexponential-Hypergeometric Functions
We present two criteria for the existence of telescopers for bivariate hyperexponential-hypergeometric functions. One is for the existence of telescopers with respect to the continuous variable, the other for telescopers with respect to the discrete one. Our criteria are based on a standard representations of bivariate hyperexponentialhypergeometric functions, and two additive decompositions.
متن کاملOn the length of integers in telescopers for proper hypergeometric terms
We show that the number of digits in the integers of a creative telescoping relation of expected minimal order for a bivariate proper hypergeometric term has essentially cubic growth with the problem size. For telescopers of higher order but lower degree we obtain a quintic bound. Experiments suggest that these bounds are tight. As applications of our results, we give an improved bound on the m...
متن کاملSome applications of differential-difference algebra to creative telescoping. (Quelques applications de l'algébre différentielle et aux différences pour le télescopage créatif)
Since the 1990’s, Zeilberger’s method of creative telescoping has played an important role in the automatic verification of special-function identities. The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration and summation in the framework of this method. Our contributions include new practical algorithms, complexity analyses of algori...
متن کاملAn Improved Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms
The Abramov-Petkovšek reduction computes an additive decomposition of a hypergeometric term, which extends the functionality of the Gosper algorithm for indefinite hypergeometric summation. We modify the AbramovPetkovšek reduction so as to decompose a hypergeometric term as the sum of a summable term and a non-summable one. The outputs of the Abramov-Petkovšek reduction and our modified version...
متن کاملDefinite Sums of Hypergeometric Terms and Limits of P-Recursive Sequences
The ubiquity of the class of D-finite functions and P-recursive sequences in symbolic computation is widely recognized. This class is defined in terms of linear differential and difference equations with polynomial coefficients. In this thesis, the presented work consists of two parts related to this class. In the first part, we generalize the reduction-based creative telescoping algorithms to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 68 شماره
صفحات -
تاریخ انتشار 2015